A Pre-congruence Format for XY-simulation
نویسندگان
چکیده
XY -simulation is a generalization of bisimulation that is parameterized with two subsets of actions. XY -simulation is known in the literature under different names such as modal refinement, partial bisimulation, and alternating simulation. In this paper, we propose a precongruence rule format for XY -simulation. The format allows for checking compositionality of XY -simulation for an arbitrary language with structural operational semantics, by performing very simple checks on the syntactic shape of the rules. We apply our format to derive concrete compositionality results for different notions of behavioral pre-order with respect to different process calculi in the literature.
منابع مشابه
On Permuting Ability of a 2D Torus under XY routing
This paper introduces an exploration to permuting ability of a 2D torus under deterministic XY routing. The research is carried out for a number of communication models, namely, unidirectional uniaxial, bidirectional uniaxial, unidirectional biaxial, and bidirectional biaxial. Necessary and sufficient conditions of blocking occurrence in a 2D torus for uniaxial models are expressed mathematical...
متن کاملStructured Operational Semantics and Bisimulation as a Congruence
In this paper the question is considered in which cases a transition system specification in Plotkin style has 'good' properties and deserves the predicate 'structured'. The discussion takes place in a setting of labelled transition systems. The states of the transition systems are terms generated by a single sorted signature and the transitions between states are defined by conditional rules. ...
متن کاملON THE NUMBER OF SOLUTIONS OF THE CONGRUENCE xy ≡ l (mod q) UNDER THE GRAPH OF A TWICE CONTINUOUSLY DIFFERENTIABLE FUNCTION
A result by V. A. Bykovskĭı (1981) on the number of solutions of the congruence xy ≡ l (mod q) under the graph of a twice continuously differentiable function is refined. As an application, Porter’s result (1975) on the mean number of steps in the Euclidean algorithm is sharpened and extended to the case of Gauss– Kuzmin statistics. §
متن کامل2-Nested Simulation Is Not Finitely Equationally Axiomatizable
2-nested simulation was introduced by Groote and Vaandrager [10] as the coarsest equivalence included in completed trace equivalence for which the tyft/tyxt format is a congruence format. In the linear time-branching time spectrum of van Glabbeek [8], 2-nested simulation is one of the few equivalences for which no finite equational axiomatization is presented. In this paper we prove that such a...
متن کاملOn the Congruence ax + by = 1 Modulo xy
We give bounds on the number of solutions to the Diophantine equation (X+1/x)(Y +1/y) = n as n → ∞. These bounds are related to the number of solutions to congruences of the form ax+by = 1 modulo xy.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015